On Tight Components and Anti-Tight Components
نویسندگان
چکیده
منابع مشابه
On Tight Components and Anti-Tight Components
A graph G = (V, E) is called factor-critical if G = ∅ and G − v has a perfect matching for every vertex v ∈ V (G). A factor-critical graph G is tight (anti-tight, respectively) if for any v ∈ V (G), any perfect matching M in G − v, and any e ∈ M , |N (v) ∩ V (e)| = 1 (|N (v) ∩ V (e)| = 2, respectively), where N (v) denotes the neighborhood of v and V (e) denotes the set of vertices incident wit...
متن کاملeffect of seed priming and irrigation regimes on yield,yield components and quality of safflowers cultivars
این مطالعه در سال 1386-87 در آزمایشگاه و مزرعه پژوهشی دانشگاه صنعتی اصفهان به منظور تعیین مناسب ترین تیمار بذری و ارزیابی اثر پرایمینگ بر روی سه رقم گلرنگ تحت سه رژیم آبیاری انجام گرفت. برخی از مطالعات اثرات سودمند پرایمینگ بذر را بر روی گیاهان مختلف بررسی کرده اند اما در حال حاضر اطلاعات کمی در مورد خصوصیات مربوط به جوانه زنی، مراحل نموی، عملکرد و خصوصیات کمی و کیفی بذور تیمار شده ژنوتیپ های م...
Nanoscale rotary apparatus formed from tight-fitting 3D DNA components.
We report a nanoscale rotary mechanism that reproduces some of the dynamic properties of biological rotary motors in the absence of an energy source, such as random walks on a circle with dwells at docking sites. Our mechanism is built modularly from tight-fitting components that were self-assembled using multilayer DNA origami. The apparatus has greater structural complexity than previous mech...
متن کاملAn asymptotically tight bound on the number of connected components of realizable sign conditions
In this paper we prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of connected components of the realizations of all realizable sign conditions of a family of real polynomials. More precisely, we prove that the number of connected components of the realizations of all realizable sign conditions of ...
متن کاملAn asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign conditions of a family of real polynomials. More precisely, we prove that the number of semi-algebraically connected components of the realizations of all realiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2015
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-015-1529-2